The Ascending Ramsey Index of a Graph
نویسندگان
چکیده
Let G be a graph with given red-blue coloring c of the edges G. An ascending Ramsey sequence in respect to is G1, G2, …, Gk pairwise edge-disjoint subgraphs such that each subgraph Gi (1≤i≤k) monochromatic and isomorphic proper Gi+1 (1≤i≤k−1). The index ARc(G) maximum length an c. AR(G) minimum value among all colorings It shown there connection between this concept set partitions. investigated for some classes highly symmetric graphs as complete graphs, matchings, stars, consisting matching star, certain double stars.
منابع مشابه
Ashwini Index of a Graph
Motivated by the terminal Wiener index, we define the Ashwini index $mathcal{A}$ of trees as begin{eqnarray*} % nonumber to remove numbering (before each equation) mathcal{A}(T) &=& sumlimits_{1leq i
متن کاملPeripheral Wiener Index of a Graph
The eccentricity of a vertex $v$ is the maximum distance between $v$ and anyother vertex. A vertex with maximum eccentricity is called a peripheral vertex.The peripheral Wiener index $ PW(G)$ of a graph $G$ is defined as the sum ofthe distances between all pairs of peripheral vertices of $G.$ In this paper, weinitiate the study of the peripheral Wiener index and we investigate its basicproperti...
متن کاملBounds for the Co-PI index of a graph
In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.
متن کاملThe Hyper-Zagreb Index of Graph Operations
Let G be a simple connected graph. The first and second Zagreb indices have been introduced as vV(G) (v)2 M1(G) degG and M2(G) uvE(G)degG(u)degG(v) , respectively, where degG v(degG u) is the degree of vertex v (u) . In this paper, we define a new distance-based named HyperZagreb as e uv E(G) . (v))2 HM(G) (degG(u) degG In this paper, the HyperZagreb index of the Cartesian p...
متن کاملThe relationship between the distinguishing number and the distinguishing index with detection number of a graph
This article has no abstract.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2023
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym15020523